Coloring Non-Crossing Strings
نویسندگان
چکیده
For a family of geometric objects in the plane F = {S1, . . . , Sn}, define χ(F) as the least integer ` such that the elements of F can be colored with ` colors, in such a way that any two intersecting objects have distinct colors. When F is a set of pseudo-disks that may only intersect on their boundaries, and such that any point of the plane is contained in at most k pseudo-disks, it can be proven that χ(F) ≤ 3k/2 + o(k) since the problem is equivalent to cyclic coloring of plane graphs. In this paper, we study the same problem when pseudodisks are replaced by a family F of pseudo-segments (a.k.a. strings) that do not cross. In other words, any two strings of F are only allowed to “touch” each other. Such a family is said to be k-touching if no point of the plane is contained in more than k elements of F . We give bounds on χ(F) as a function of k, and in particular we show that k-touching segments can be colored with k + 5 colors. This partially answers a question of Hliněný (1998) on the chromatic number of contact systems of strings. E-mail addresses: [email protected], [email protected], [email protected]. A preliminary version of this work appeared in the proceedings of EuroComb’09 [5]. Louis Esperet is partially supported by ANR Project Stint (anr-13-bs02-0007) and LabEx PERSYVAL-Lab (anr-11-labx-0025-01). Arnaud Labourel is partially supported by ANR project MACARON (anr-13-js02-0002). 1 ar X iv :1 51 1. 03 82 7v 1 [ m at h. C O ] 1 2 N ov 2 01 5 2 L. ESPERET, D. GONÇALVES, AND A. LABOUREL
منابع مشابه
On the Enumeration of Non-crossing Pairings of Well-balanced Binary Strings
A non-crossing pairing on a binary string pairs ones and zeroes such that the arcs representing the pairings are non-crossing. A binary string is well-balanced if it is of the form 11011202 . . . 1r0r . In this paper we establish connections between non-crossing pairings of well-balanced binary strings and various lattice paths in plane. We show that for well-balanced binary strings with a1 ≤ a...
متن کاملConvex Recolorings of Strings and Trees
A coloring of a tree is convex if the vertices that pertain to any color induce a connected subtree; a partial coloring (which assigns colors to some of the vertices) is convex if it can be completed to a convex (total) coloring. Convex coloring of trees arises in areas such as phylogenetics, linguistics, etc. eg, a perfect phylogenetic tree is one in which the states of each character induce a...
متن کاملThe Non-Crossing Graph
Two sets are non-crossing if they are disjoint or one contains the other. The noncrossing graph NCn is the graph whose vertex set is the set of nonempty subsets of [n] = {1, . . . , n} with an edge between any two non-crossing sets. Various facts, some new and some already known, concerning the chromatic number, fractional chromatic number, independence number, clique number and clique cover nu...
متن کاملOn the Varshamov-Tenengolts construction on binary strings
This paper is motivated by the problem of finding the largest single-deletion-correcting code for binary strings. The Varshamov–Tenengolts construction classifies binary strings into non-overlapping sets, the largest set of these is asymptotically the largest singledeletion-correcting code. However despite the asymptotic optimality little is known about the quality of the construction as a func...
متن کاملConvex Recolorings of Strings and Trees: Definitions, Hardness Results and Algorithms
A coloring of a tree is convex if the vertices that pertain to any color induce a connected subtree; a partial coloring (which assigns colors to some of the vertices) is convex if it can be completed to a convex (total) coloring. Convex colorings of trees arise in areas such as phylogenetics, linguistics, etc., e.g., a perfect phylogenetic tree is one in which the states of each character induc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 23 شماره
صفحات -
تاریخ انتشار 2016